Error checking with client-driven pointer analysis
نویسندگان
چکیده
منابع مشابه
Error checking with client-driven pointer analysis
This paper presents a new client-driven pointer analysis algorithm that automatically adjusts its precision in response to the needs of client analyses. Using five significant error detection problems as clients, we evaluate our algorithm on 18 real C programs. We compare the accuracy and performance of our algorithm against several commonly-used fixedprecision algorithms. We find that the clie...
متن کاملClient-Driven Pointer Analysis
This paper presents a new client-driven pointer analysis algorithm that automatically adjusts its precision in response to the needs of client analyses. We evaluate our algorithm on 18 real C programs, using five significant error detection problems as clients. We compare the accuracy and performance of our algorithm against several commonly-used fixed-precision algorithms. We find that the cli...
متن کاملTowards model-checking pointer systems
The aim of this work is to investigate the possibility of using a counter machines modelchecker, FAST [2] for instance, for programs working over singly-linked lists. We define a CTL logic which may express quantitative properties and shape properties on the memory managed by pointer systems. For this temporal logic, we show that the model-checking problem reduces to the one for counter systems...
متن کاملBounded Model Checking of Pointer Programs
We propose a bounded model checking procedure for programs manipulatingdynamically allocated pointer structures. Our procedure checks whether aprogram execution of length n ends in an error (e. g., a NULL dereference)by testing if the weakest precondition of the error condition together with theinitial condition of the program (e. g., program variable x points to a circularl...
متن کاملChecking the Shape Safety of Pointer Manipulations
We present a new algorithm for checking the shape-safety of pointer manipulation programs. In our model, an abstract, data-less pointer structure is a graph. A shape is a language of graphs. A pointer manipulation program is modelled abstractly as a set of graph rewrite rules over such graphs where each rule corresponds to a pointer manipulation step. Each rule is annotated with the intended sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2005
ISSN: 0167-6423
DOI: 10.1016/j.scico.2005.02.005